On Increasing Subsequences of I.i.d. Samples
نویسنده
چکیده
We study the uctuations, in the large deviations regime, of the longest increasing subsequence of a random i.i.d. sample on the unit square. In particular, our results yield the precise upper and lower exponential tails for the length of the longest increasing subsequence of a random permutation. i=1 denote a sequence of i.i.d. random variables with marginal law on the unit square Q = 0; 1] 2. Throughout, we make the assumption that possesses a strictly positive density p 2 C 1 (Q) with respect to the Lebesgue measure on Q. Deene next`max (n) to be the length of the longest increasing subsequence in the sample fZ i g n i=1. Note that we do not require that i j < i j+1. In case that = , ` max (n) possesses the same law as the length of the longest increasing subsequence of a random permutation, denoted hereafter by L max (n). Building on the fact that lim n!1 L max (n) p n = 2 in probability; cf. 8], we showed in 3] that (1.1) lim n!1
منابع مشابه
On Increasing Subsequences Of
We study the fluctuations, in the large deviations regime, of the longest increasing subsequence of a random i.i.d. sample on the unit square. In particular, our results yield the precise upper and lower exponential tails for the length of the longest increasing subsequence of a random permutation. §.
متن کاملOn permutation-invariance of limit theorems
By a classical principle of probability theory, sufficiently thin subsequences of general sequences of random variables behave like i.i.d. sequences. This observation not only explains the remarkable properties of lacunary trigonometric series, but also provides a powerful tool in many areas of analysis, such the theory of orthogonal series and Banach space theory. In contrast to i.i.d. sequenc...
متن کاملMining Biological Repetitive Sequences Using Support Vector Machines and Fuzzy SVM
Structural repetitive subsequences are most important portion of biological sequences, which play crucial roles on corresponding sequence’s fold and functionality. Biggest class of the repetitive subsequences is “Transposable Elements” which has its own sub-classes upon contexts’ structures. Many researches have been performed to criticality determine the structure and function of repetitiv...
متن کاملIncreasing Subsequences in Nonuniform Random Permutations
Connections between longest increasing subsequences in random permutations and eigenvalues of random matrices with complex entries have been intensely studied. This note applies properties of random elements of the finite general linear group to obtain results about the longest increasing and decreasing subsequences in non-uniform random permutations.
متن کاملEnsembles of change-point methods to estimate the change point in residual sequences
Change-Point Methods (CPMs) are statistical tests design to assess whether a given sequence comes from an unique, stationary, data-generating process. CPMs eventually estimate the change-point location, i.e., the point where the data-generating process shifted. While there exists a large literature concerning CPMs meant for sequences of independent and identically distributed (i.i.d.) random va...
متن کامل